Lookup-Ring: Building Efficient Lookups for High Dynamic Peer-to-Peer Overlays
نویسندگان
چکیده
This paper is motivated by the problem of poor searching efficiency in decentralized peer-to-peer file-sharing systems. We solve the searching problem by considering and modeling the basic trade-off between forwarding queries among peers and maintaining lookup tables in peers, so that we can utilize optimized lookup table scale to minimize bandwidth consumption, and to greatly improve the searching performance under arbitrary system parameters and resource constraints (mainly the available bandwidth). Based on the model, we design a decentralized peer-to-peer searching strategy, namely the Lookup-ring, which provides very efficient keyword searching in high dynamic peer-to-peer environments. The simulation results show that Lookupring can easily support a large-scale system with more than 10 participating peers at a very small cost in each peer.
منابع مشابه
PathFinder: Efficient Lookups and Efficient Search in Peer-to-Peer Networks
Peer-to-Peer networks are divided into two main classes: unstructured and structured. Overlays from the first class are better suited for exhaustive search, whereas those from the second class offer very efficient key-value lookups. In this paper we present a novel overlay, PathFinder, which combines the advantages of both classes within one single overlay for the first time. Our evaluation sho...
متن کاملTAC: A Topology-Aware Chord-based Peer-to-Peer Network
Among structured Peer-to-Peer systems, Chord has a general popularity due to its salient features like simplicity, high scalability, small path length with respect to network size, and flexibility on node join and departure. However, Chord doesn’t take into account the topology of underlying physical network when a new node is being added to the system, thus resulting in high routing late...
متن کاملTwo Hop Lookups for Large Scale Peer-to-Peer Overlays
Most current peer-to-peer lookup algorithms keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. Lookups have high latency as each lookup requires contacting several nodes in sequence. In [2] we proposed a one hop lookup scheme, which scales up to systems of around ten million nodes. Lookups take only one hop most of the time, and this enables a l...
متن کاملSharing of Probabilistically Correlated Data in Peer-to-Peer Networks
The impact of Peer-to-Peer (P2P) networks on the Internet landscape is undisputed. It has led to a series of new applications, e.g., as part of the socalled Web 2.0. The shift from the classical client-server based paradigm of the Internet, with a clear distinction between information providers and consumers, towards consumers sharing information among each other led to the rise of the P2P para...
متن کاملOne Hop Lookups for Peer-to-Peer Overlays
Current peer-to-peer lookup algorithms have been designed with the assumption that routing information at each member node must be kept small, so that the bookkeeping required to respond to system membership changes is also small. In this paper, we show that this assumption is unnecessary, and present a technique that maintains complete routing tables at each node. The technique is able to hand...
متن کامل